Query Rewriting in Horn-SHIQ
نویسندگان
چکیده
Despoina Trivela, Giorgos Stoilos, Alexandros Chortaras, and Giorgos Stamou School of Electrical and Computer Engineering, National Technical University of Athens, Greece
منابع مشابه
Towards Practical Query Answering for Horn-SHIQ
Query answering has become a prominent reasoning task in Description Logics. This is witnessed not only by the high number of publications on the topic in the last decade, but also by the increasing number of query answering engines. A number of systems provide full conjunctive query (CQ) answering capabilities, including [1, 23, 25, 4, 11]. A common feature of these approaches is that they rel...
متن کاملQuery Rewriting for Horn-SHIQ Plus Rules
Query answering over Description Logic (DL) ontologies has become a vibrant field of research. Efficient realizations often exploit database technology and rewrite a given query to an equivalent SQL or Datalog query over a database associated with the ontology. This approach has been intensively studied for conjunctive query answering in the DL-Lite and EL families, but is much less explored fo...
متن کاملQuery Answering in the Description Logic Horn - SHIQ
We provide an ExpTime algorithm for answering conjunctive queries (CQs) in Horn-SHIQ, a Horn fragment of the well-known Description Logic SHIQ underlying the OWL-Lite standard. The algorithm employs a domino system for model representation, which is constructed via a worst-case optimal tableau algorithm for Horn-SHIQ; the queries are answered by reasoning over the domino system. Our algorithm n...
متن کاملOptimising Resolution-Based Rewriting Algorithms for OWL OntologiesI
An important approach to query answering over OWL ontologies is via rewriting the input ontology (and query) into a new set of axioms that are expressed in logics for which scalable query answering algorithms exist. This approach has been studied for many important fragments of OWL like SHIQ, Horn-SHIQ, OWL 2 QL, and OWL 2 EL. An important family of rewriting algorithms is the family of resolut...
متن کاملOptimising resolution-based rewriting algorithms for OWL ontologies
An important approach to query answering over OWL ontologies is via rewriting the input ontology (and query) into a new set of axioms that are expressed in logics for which scalable query answering algorithms exist. This approach has been studied for many important fragments of OWL like SHIQ, Horn-SHIQ, OWL 2 QL, and OWL 2 EL. An important family of rewriting algorithms is the family of resolut...
متن کامل